A Hybrid Crow Search Algorithm for Solving Permutation Flow Shop Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Solving hybrid flow shop scheduling problems using bat algorithm
This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed...
متن کاملA Novel Hybrid Algorithm for Permutation Flow Shop Scheduling
In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customer’s constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing pr...
متن کاملSolving Flow Shop Scheduling Problems Using a Hybrid Genetic Scatter Search Algorithm
In this paper we consider n-jobs, m-machines permutation flow shop scheduling problems. Flow shop scheduling is one of the most important combinational optimization problems. The permutation flow shop scheduling problems are NP-Hard (Non deterministic Polynomial time Hard). Hence many heuristics and metaheuristics were addressed in the literature to solve these problems. In this paper a hybrid ...
متن کاملA Two-Phase Hybrid Particle Swarm Optimization Algorithm for Solving Permutation Flow-Shop Scheduling Problem
In this paper, a two-phase hybrid particle swarm optimization algorithm (PRHPSO) is proposed for the permutation flow-shop scheduling problem (PFSP) with the minimizing makespan measure. The smallest position value (SPV) rule is used for encoding the particles that enable PSO for suitable PFSP, and the NEH and Tabu search algorithms are used for initializing the particles. In the first phase, t...
متن کاملNNMA: An effective memetic algorithm for solving multiobjective permutation flow shop scheduling problems
The permutation flow shop scheduling problem is addressed in this paper. Two objectives, minimization of makespan and total flow time, are considered. We propose a memetic algorithm, called NNMA, by integrating a general multiobjective evolutionary algorithm (NSGA-II) with a problem-specific heuristic (NEH). We take NEH as a local improving procedure in NNMA and propose several adaptations incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2019
ISSN: 2076-3417
DOI: 10.3390/app9071353